package qjc.k_二分查找;

public class k4_搜索旋转排序数组 {
    public int search(int[] nums, int target) {
        int n = nums.length;
        int left = 0, right = n - 1;
        if (n == 0) {
            return 0;
        }
        if (n == 1) {
            return n == target ? 0 : -1;
        }
        while (left <= right) {
            int mid = (left + right) >>> 1;
            if(nums[mid] == target) {
                return mid;
            }
            if(nums[0]<nums[mid]) {
                if(nums[0]<=target && target<=nums[mid]) {
                    right = mid - 1;
                }else {
                    left = mid + 1;
                }
            }
            else {
                if(nums[mid]<target && target<=nums[right]) {
                    left = mid + 1;
                }else {
                    right = mid - 1;
                }
            }
        }
        return -1;
    }
}
